Blockwise Sparse Regression

نویسندگان

  • Yuwon Kim
  • Jinseog Kim
  • Yongdai Kim
  • YUWON KIM
  • JINSEOG KIM
  • YONGDAI KIM
چکیده

Yuan an Lin (2004) proposed the grouped LASSO, which achieves shrinkage and selection simultaneously, as LASSO does, but works on blocks of covariates. That is, the grouped LASSO provides a model where some blocks of regression coefficients are exactly zero. The grouped LASSO is useful when there are meaningful blocks of covariates such as polynomial regression and dummy variables from categorical variables. In this paper, we propose an extension of the grouped LASSO, called ‘Blockwise Sparse Regression’ (BSR). The BSR achieves shrinkage and selection simultaneously on blocks of covariates similarly to the grouped LASSO, but it works for general loss functions including generalized linear models. An efficient computational algorithm is developed and a blockwise standardization method is proposed. Simulation results show that the BSR compromises the ridge and LASSO for logistic regression. The proposed method is illustrated with two datasets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying Parallel Direct Solver Techniques to Build Robust High Performance Preconditioners

The purpose of our work is to provide a method which exploits the parallel blockwise algorithmic approach used in the framework of high performance sparse direct solvers in order to develop robust preconditioners based on a parallel incomplete factorization. The idea is then to define an adaptive blockwise incomplete factorization that is much more accurate (and numerically more robust) than th...

متن کامل

Penalized Estimation of Directed Acyclic Graphs From Discrete Data

The Bayesian network, with structure given by a directed acyclic graph (DAG), is a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and the difficulty in searching for a sparse structure. In this article, we develop a maximum penalized likelihood method to tackle this problem. I...

متن کامل

Image Deblurring Via Total Variation Based Structured Sparse Model Selection

Retina imaging technology is an effective control method for early diagnosis and early treatment of the diabetic retinopathy. In this paper, a fast robust inverse diffusion equation combining a blockwise filtering is presented to detect and evaluate diabetic retinopathy using retinal image enhancement. A flux corrected transport technique is used to control diffusion flux adaptively, which elim...

متن کامل

A Blockwise Descent Algorithm for Group-penalized Multiresponse and Multinomial Regression

In this paper we purpose a blockwise descent algorithm for group-penalized multiresponse regression. Using a quasi-newton framework we extend this to group-penalized multinomial regression. We give the first publicly available implementation for these in R, and compare the speed of this algorithm to a similar algorithm for standard `1-penalized multinomial regression on simulated data — we show...

متن کامل

Partitioning and Blocking Issues for a Parallel Incomplete Factorization

The purpose of this work is to provide a method which exploits the parallel blockwise algorithmic approach used in the framework of high performance sparse direct solvers in order to develop robust and efficient preconditioners based on a parallel incomplete factorization.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006